ISRO CSE 2016


Q21.

The simplified SOP (Sum of Product) from the Boolean expression(P + \bar{Q} + \bar{R}) . (P + {Q} + R) . (P + Q +\bar{R})is
GateOverflow

Q22.

The minimum Boolean expression for the following circuit is
GateOverflow

Q23.

Consider the following gate networkWhich one of the following gates is redundant?
GateOverflow

Q24.

The minimum number of \text{NAND} gates required to implement the Boolean function A + A\bar{B} + A\bar{B}C is equal to
GateOverflow

Q25.

The maximum number of edges in a n-node undirected graph without self loops is
GateOverflow

Q26.

A given connected graph G is a Euler Graph if and only if all vertices of G are of
GateOverflow

Q27.

f (G,.) is a group such that (ab)^{-1}=a^{-1}b^{-1},\forall a,b \in G, then G is a/an
GateOverflow

Q28.

Which one of the following is correct about the statements given below? I. All function calls are resolved at compile time in C lang II. All function calls are resolved at compile time in C++ lang
GateOverflow

Q29.

A Hash Function f defined as f(key)=keymod7. With linear probing while inserting the keys 37,38,72,48,98,11,56 into a table indexed from 0, in which location key 11 will be stored (Count table index 0 as 0^{th} location)?
GateOverflow

Q30.

For a binary half-subtractor having two inputs A and B, the correct set of logical outputs D(=A minus B) and X(=borrow) are
GateOverflow